Proofs with graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proofs with Graphs

We present a graphical calculus, which allows mathematical formulae to be represented and reasoned about using a visual representation. We deene how a formula may be represented by a graph, and present a number of laws for transforming graphs, and describe the eeects these transformations have on the corresponding formulae. We then use these transformation laws to perform proofs. We illustrate ...

متن کامل

Some Notes on Proofs with Alpha Graphs

It is well-known that Peirce’s Alpha graphs correspond to propositional logic (PL). Nonetheless, Peirce’s calculus for Alpha graphs differs to a large extent to the common calculi for PL. In this paper, some aspects of Peirce’s calculus are exploited. First of all, it is shown that the erasure-rule of Peirce’s calculus, which is the only rule which does not enjoy the finite choice property, is ...

متن کامل

Proofs as graphs

This note introduces a method of representing and reasoning about the actions of a class of proof procedures. A graph-like structure, called a proof diagram, is introduced in which conclusions of inferences can be shared. A version of Kruskal's Tree Theorem is developed for these structures and from there a notion of minimal proof is introduced. The notion of minimal proof allows us to make a l...

متن کامل

Random Electrical Networks on Complete Graphs Ii: Proofs

Geoffrey Grimmett and Harry Kesten Abstra t. This paper contains the proofs of Theorems 2 and 3 of the article entitled Random electrical networks on complete graphs, written by the same authors and published in the Journal of the London Mathematical Society, vol. 30 (1984), pp. 171–192. The current paper was written in 1983 but was not published in a journal, although its existence was announc...

متن کامل

Efficient Proofs on Committed Graphs and NP - Statements

Digital signature schemes are a foundational building block enabling integrity and non-repudiation. We propose a graph signature scheme and corresponding proofs that allow a prover (1) to obtain a signature on a committed graph and (2) to subsequently prove to a verifier knowledge of such a graph signature. The graph signature scheme and proofs are a building block for certification systems tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 1996

ISSN: 0167-6423

DOI: 10.1016/0167-6423(95)00025-9